Converting First Order Logic into Natural Language: A First Level Approach
نویسندگان
چکیده
In this paper, we present the FOLtoNL system, which converts first order logic (FOL) sentences into natural language (NL) ones. The motivation comes from an intelligent tutoring system teaching logic as a knowledge representation language, where we use it as a means for feedback to the users. FOL to NL conversion is achieved by using a rule-based approach, where we exploit the pattern matching capabilities of rules. The system consists of a rulebased system and a lexicon. The expert system implements the conversion algorithm, which is based on a linguistic analysis of a FOL sentence, and the lexicon provides grammatical information that helps in producing the NL sentence. The whole system is implemented in Jess, a java-based expert system shell. The FOLtoNL is not complete in all its aspects yet.
منابع مشابه
Annotating Websites with Machine-processable Information in Controlled Natural Language
In this paper we present a user friendly approach to annotate websites with machine-processable information in controlled natural language. The controlled natural language serves as a high-level specification and knowledge representation language which allows human annotators to summarise individual web pages of a website and to express domain-specific ontological knowledge about that website i...
متن کاملIn pursuit of decidable ‘logical form’
Natural language interfaces commonly map to some type of logical form that represents the meaning of the user’s utterance. It is rare however, that this logical form is bona fide logic (e.g. expressions that may be tested for satisfiability, etc.). We explore an approach that limits logical form to decidable logics and exploits this property by deeply integrating theorm proving into analysis, p...
متن کاملAn Adjunction-Theoretic Foundation for Proof Search in Intuitionistic First-Order Categorical Logic Programming
In this thesis we compose a proof-theoretic approach to logic programming with a category-theoretic approach to proof theory. This allows us to present the computation mechanisms of several systems of logic programming as proof search strategies within an intuitionistic first-order sequent calculus with logic variables and to analyze aspects of their behavior algebraically. Beginning from the b...
متن کاملOn the compactness property of extensions of first-order G"{o}del logic
We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...
متن کاملNatural Language Understanding Using Temporal Action Logic
We consider a logicist approach to natural language understanding based on the translation of a quasi-logical form into a temporal logic, explicitly constructed for the representation of action and change, and the subsequent reasoning about this semantic structure in the context of a background knowledge theory using automated theorem proving techniques. The approach is substantiated through a ...
متن کامل